Undecidable theories of valuated abelian groups
نویسندگان
چکیده
© Mémoires de la S. M. F., 1984, tous droits réservés. L’accès aux archives de la revue « Mémoires de la S. M. F. » (http:// smf.emath.fr/Publications/Memoires/Presentation.html) implique l’accord avec les conditions générales d’utilisation (http://www.numdam.org/legal.php). Toute utilisation commerciale ou impression systématique est constitutive d’une infraction pénale. Toute copie ou impression de ce fichier doit contenir la présente mention de copyright.
منابع مشابه
A simple proof of the hereditary undecidability of the theory of lattice-ordered abelian groups
In 1967 Gurevich [3] published a proof that the class of divisible Axchimedean lat t ice-ordered abelian groups such that the lattice of carriers is an atomic Boolean algebra has a hereditarily undecidable first-order theory. (He essentially showed the reduct of this class to lattices has a hereditarily undecidable first-order theory: on p. 49 of his paper change z ~ u + v to z ~ u v v in the d...
متن کاملTheory of Square-like Abelian Groups Is Decidable
A group is called square-like if it is universally equivalent to its direct square. It is known that the class of all square-like groups admits an explicit first order axiomatization but its theory is undecidable. We prove that the theory of square-like abelian groups is decidable. This answers a question posed by D. Spellman.
متن کاملTwo-Way Equational Tree Automata for AC-Like Theories: Decidability and Closure Properties
We study two-way tree automata modulo equational theories. We deal with the theories of Abelian groups (ACUM ), idempotent commutative monoids (ACUI), and the theory of exclusive-or (ACUX), as well as some variants including the theory of commutative monoids (ACU ). We show that the one-way automata for all these theories are closed under union and intersection, and emptiness is decidable. For ...
متن کاملThe Post correspondence problem in groups
We generalize the classical Post correspondence problem (PCPn) and its non-homogeneous variation (GPCPn) to non-commutative groups and study the computational complexity of these new problems. We observe that PCPn is closely related to the equalizer problem in groups, while GPCPn is connected to the double twisted conjugacy problem for endomorphisms. Furthermore, it is shown that one of the str...
متن کاملFinitely Presented Abelian Lattice-Ordered Groups
We give necessary and sufficient conditions for the first-order theory of a finitely presented abelian lattice-ordered group to be decidable. We also show that if the number of generators is at most 3, then elementary equivalence implies isomorphism. We deduce from our methods that the theory of the free MV -algebra on at least 2 generators is undecidable.
متن کامل